A New-type Pi Calculus with Buffers and Its Bisimulation
نویسندگان
چکیده
According to the features of asynchronous interaction in systems, a new-type Pi calculus with buffers — Buffer-Pi calculus is proposed, the new labelled transition system based on buffers is introduced, the enhanced describing capability is shown to apply Buffer-Pi calculus to modeling with the concrete example of asynchronous interaction, and the new behavior equivalence relations are defined, several propositions and properties of Buffer-Pi calculus are given. The study shows that compared with Pi calculus, Buffer-Pi calculus can provide more powerful support for asynchronous behavior modeling in systems.
منابع مشابه
A pure labeled transition semantics for the applied pi calculus
The applied pi calculus proposed by Abadi and Fournet is successful in the analysis of security protocols. Its semantics mainly depends on several structural rules. Structural rules are convenient for specification, but inefficient for implementation. In this paper, we establish a new semantics for applied pi calculus based upon pure labeled transition system and propose a new formulation of la...
متن کاملThe Receptive Distributed pi-Calculus (Extended Abstract)
In this paper we study an asynchronous distributed-calculus, with constructs for localities and migration. We show that a simple static analysis ensures the receptiveness of channel names, which, together with a simple type system, guarantees a local deadlock-freedom property, that we call message deliverability. This property states that any migrating message will nd an appropriate receiver at...
متن کاملOn the Asynchronous Nature of the Asynchronous pi-Calculus
We address the question of what kind of asynchronous communication is exactly modeled by the asynchronous π-calculus (πa). To this purpose we define a calculus πB where channels are represented explicitly as special buffer processes. The base language for πB is the (synchronous) π-calculus, except that ordinary processes communicate only via buffers. Then we compare this calculus with πa. It tu...
متن کاملIntroducing Timers to π-Calculus
We introduce a new concept of modeling timed behavior in pi-calculus by representing timed actions (or timers) as interactions between application processes and clock processes. This approach extends the original calculus in a manner such that bisimulation arrangements in pi-calculus remain untouched.
متن کاملA Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first proof of its kind to be wholly machine checked. Although the result has been known for some time the proof had parts which needed careful attention to detail to become completely formal. It is not that the result was ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JCP
دوره 7 شماره
صفحات -
تاریخ انتشار 2012